منابع مشابه
$k$-tuple total restrained domination/domatic in graphs
For any integer $kgeq 1$, a set $S$ of vertices in a graph $G=(V,E)$ is a $k$-tuple total dominating set of $G$ if any vertex of $G$ is adjacent to at least $k$ vertices in $S$, and any vertex of $V-S$ is adjacent to at least $k$ vertices in $V-S$. The minimum number of vertices of such a set in $G$ we call the $k$-tuple total restrained domination number of $G$. The maximum num...
متن کاملTotal Restrained Bondage in Graphs
A subset S of vertices of a graph G with no isolated vertex is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex in V (G) − S is also adjacent to a vertex in V (G) − S. The total restrained domination number of G is the minimum cardinality of a total restrained dominating set of G. In this paper we initiate the study of total restrained bondage in g...
متن کاملResults on Total Restrained Domination in Graphs
Let G = (V,E) be a graph. A set S ⊆ V (G) is a total restrained dominating set if every vertex of G is adjacent to a vertex in S and every vertex of V (G)\S is adjacent to a vertex in V (G)\S. The total restrained domination number of G, denoted by γtr(G), is the smallest cardinality of a total restrained dominating set of G. In this paper we continue the study of total restrained domination in...
متن کاملTotal restrained domination in unicyclic graphs
Let G = (V,E) be a graph. A set S ⊆ V is a total restrained dominating set if every vertex in V is adjacent to a vertex in S and every vertex of V −S is adjacent to a vertex in V −S. The total restrained domination number of G, denoted by γtr(G), is the minimum cardinality of a total restrained dominating set of G. A unicyclic graph is a connected graph that contains precisely one cycle. We sho...
متن کامل$k$-tuple total restrained domination/domatic in graphs
for any integer $kgeq 1$, a set $s$ of vertices in a graph $g=(v,e)$ is a $k$-tuple total dominating set of $g$ if any vertex of $g$ is adjacent to at least $k$ vertices in $s$, and any vertex of $v-s$ is adjacent to at least $k$ vertices in $v-s$. the minimum number of vertices of such a set in $g$ we call the $k$-tuple total restrained domination number of $g$. the maximum num...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AKCE International Journal of Graphs and Combinatorics
سال: 2016
ISSN: 0972-8600,2543-3474
DOI: 10.1016/j.akcej.2016.02.003